The effective algorithm for solving the quadratic diofantic equation with three unknowns
نویسنده
چکیده
The article is devoted to the problem of finding the triples of integer numbers generating equal sums of the squares in the linear combination. At first the theorem giving the conditions of existing two equal sums of the squares is presented. Based on it the algorithm for finding the triples of the integer numbers generating equal sums of the squares is built. The time complexity is calculated and the effectiveness for different size of the input parameters is verified.
منابع مشابه
Iterative algorithm for the generalized $(P,Q)$-reflexive solution of a quaternion matrix equation with $j$-conjugate of the unknowns
In the present paper, we propose an iterative algorithm for solving the generalized $(P,Q)$-reflexive solution of the quaternion matrix equation $overset{u}{underset{l=1}{sum}}A_{l}XB_{l}+overset{v} {underset{s=1}{sum}}C_{s}widetilde{X}D_{s}=F$. By this iterative algorithm, the solvability of the problem can be determined automatically. When the matrix equation is consistent over...
متن کاملSOLVING NONLINEAR KLEIN-GORDON EQUATION WITH A QUADRATIC NONLINEAR TERM USING HOMOTOPY ANALYSIS METHOD
In this paper, nonlinear Klein-Gordon equation with quadratic term is solved by means of an analytic technique, namely the Homotopy analysis method (HAM).Comparisons are made between the Adomian decomposition method (ADM), the exact solution and homotopy analysis method. The results reveal that the proposed method is very effective and simple.
متن کاملSolving A Fractional Program with Second Order Cone Constraint
We consider a fractional program with both linear and quadratic equation in numerator and denominator having second order cone (SOC) constraints. With a suitable change of variable, we transform the problem into a second order cone programming (SOCP) problem. For the quadratic fractional case, using a relaxation, the problem is reduced to a semi-definite optimization (SDO) program. The p...
متن کاملSolving the liner quadratic differential equations with constant coefficients using Taylor series with step size h
In this study we produced a new method for solving regular differential equations with step size h and Taylor series. This method analyzes a regular differential equation with initial values and step size h. this types of equations include quadratic and cubic homogenous equations with constant coeffcients and cubic and second-level equations.
متن کاملAbout One Sweep Algorithm for Solving Linear-Quadratic Optimization Problem with Unseparated Two-Point Boundary Conditions
In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contrast to the well-known methods, here it refuses to solve linear matrix and nonlinear Riccati equations, since the solution of such multi-point optimi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Annales UMCS, Informatica
دوره 3 شماره
صفحات -
تاریخ انتشار 2005